Sciweavers

2412 search results - page 187 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
98
Voted
SCHEDULING
2008
67views more  SCHEDULING 2008»
15 years 3 months ago
Exact train pathing
Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it...
Viswanath Nagarajan, Abhiram G. Ranade
146
Voted
IFIP12
2008
15 years 5 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
141
Voted
PODC
2006
ACM
15 years 9 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
147
Voted
IPSN
2005
Springer
15 years 9 months ago
Lazy inference on object identities in wireless sensor networks
Tracking the identities of moving objects is an important aspect of most multi-object tracking applications. Uncertainty in sensor data, coupled with the intrinsic difficulty of ...
Jaewon Shin, Nelson Lee, Sebastian Thrun, Leonidas...
115
Voted
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 3 months ago
On formulas for decoding binary cyclic codes
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
Daniel Augot, Magali Bardet, Jean-Charles Faug&egr...