Results 1  10
of
136,871
Uniform Kernelization Complexity of Hitting Forbidden Minors
"... The FMinorFree Deletion problem asks, for a fixed set F and an input consisting of a graph G and integer k, whether k vertices can be removed from G such that the resulting graph does not contain any member of F as a minor. It generalizes classic graph problems such as Vertex Cover and Feedback Ve ..."
Abstract
 Add to MetaCart
, k) can efficiently be reduced to equivalent instances (G′, k) of size f(F) · kg(F) for some functions f and g. The degree g of the polynomial grows very quickly; it is not even known to be computable. Fomin et al. left open whether Planar FMinorFree Deletion has kernels whose size is uniformly
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
Scheduler Activations: Effective Kernel Support for the UserLevel Management of Parallelism
 ACM Transactions on Computer Systems
, 1992
"... Threads are the vehicle,for concurrency in many approaches to parallel programming. Threads separate the notion of a sequential execution stream from the other aspects of traditional UNIXlike processes, such as address spaces and I/O descriptors. The objective of this separation is to make the expr ..."
Abstract

Cited by 475 (21 self)
 Add to MetaCart
the expression and control of parallelism sufficiently cheap that the programmer or compiler can exploit even finegrained parallelism with acceptable overhead. Threads can be supported either by the operating system kernel or by userlevel library code in the application address space, but neither approach has
Statecharts: A Visual Formalism For Complex Systems
, 1987
"... We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discreteevent systems, such as multicomputer realtime systems, communication protocols and digital control units. Our diagrams, which we cal ..."
Abstract

Cited by 2683 (56 self)
 Add to MetaCart
We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discreteevent systems, such as multicomputer realtime systems, communication protocols and digital control units. Our diagrams, which we
Hitting forbidden minors: Approximation and kernelization
 IN PROCEEDINGS OF THE 8TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011
"... We study a general class of problems called FDeletion problems. In an FDeletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such that the resulting graph does not contain as a minor any graph from the family F of forbidden minors. We obtain a number o ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
We study a general class of problems called FDeletion problems. In an FDeletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such that the resulting graph does not contain as a minor any graph from the family F of forbidden minors. We obtain a number
Large Margin Classification Using the Perceptron Algorithm
 Machine Learning
, 1998
"... We introduce and analyze a new algorithm for linear classification which combines Rosenblatt 's perceptron algorithm with Helmbold and Warmuth's leaveoneout method. Like Vapnik 's maximalmargin classifier, our algorithm takes advantage of data that are linearly separable with large ..."
Abstract

Cited by 518 (2 self)
 Add to MetaCart
with large margins. Compared to Vapnik's algorithm, however, ours is much simpler to implement, and much more efficient in terms of computation time. We also show that our algorithm can be efficiently used in very high dimensional spaces using kernel functions. We performed some experiments using our
A Hierarchical Internet Object Cache
 IN PROCEEDINGS OF THE 1996 USENIX TECHNICAL CONFERENCE
, 1995
"... This paper discusses the design andperformance of a hierarchical proxycache designed to make Internet information systems scale better. The design was motivated by our earlier tracedriven simulation study of Internet traffic. We believe that the conventional wisdom, that the benefits of hierarch ..."
Abstract

Cited by 501 (6 self)
 Add to MetaCart
, we relate our experience fitting the cache into the increasingly complex and operational world of Internet information systems, including issues related to security, transparency to cacheunaware clients, and the role of file systems in support of ubiquitous widearea information systems.
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
The emotional dog and its rational tail: a social intuitionist approach to moral judgment
 Psychological Review
, 2001
"... This is the manuscript that was published, with only minor copyediting alterations, as: Haidt, J. (2001). The emotional dog and its rational tail: A social intuitionist approach to moral judgment. Psychological Review. 108, 814834 Copyright 2001, American Psychological Association To obtain a repr ..."
Abstract

Cited by 629 (20 self)
 Add to MetaCart
This is the manuscript that was published, with only minor copyediting alterations, as: Haidt, J. (2001). The emotional dog and its rational tail: A social intuitionist approach to moral judgment. Psychological Review. 108, 814834 Copyright 2001, American Psychological Association To obtain a
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical
Results 1  10
of
136,871