Sciweavers

1012 search results - page 62 / 203
» Segment intersection searching problems in general settings
Sort
View
AIPS
2000
15 years 1 months ago
Planning with Incomplete Information as Heuristic Search in Belief Space
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
Blai Bonet, Hector Geffner
ATAL
2005
Springer
15 years 5 months ago
Optimal status sets of heterogeneous agent programs
There are many situations where an agent can perform one of several sets of actions in responses to changes in its environment, and the agent chooses to perform the set of actions...
Bogdan Stroe, V. S. Subrahmanian, Sudeshna Dasgupt...
CVIU
2006
169views more  CVIU 2006»
14 years 12 months ago
A generic structure-from-motion framework
We introduce a generic structure-from-motion approach based on a previously introduced, highly general imaging model, where cameras are modeled as possibly unconstrained sets of p...
Srikumar Ramalingam, Suresh K. Lodha, Peter F. Stu...
JCIT
2008
138views more  JCIT 2008»
14 years 11 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 7 days ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...