Sciweavers

234 search results - page 27 / 47
» Time skewing made simple
Sort
View
ECAI
2010
Springer
13 years 8 months ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert
TIP
1998
162views more  TIP 1998»
13 years 7 months ago
Variational image segmentation using boundary functions
Abstract—A general variational framework for image approximation and segmentation is introduced. By using a continuous “line-process” to represent edge boundaries, it is poss...
Gary A. Hewer, Charles S. Kenney, B. S. Manjunath
SIGMOD
2008
ACM
97views Database» more  SIGMOD 2008»
13 years 7 months ago
Exploring ocean data
In fall of 2004, we met Jim Gray and began to converse about the data needs of ocean scientists. The conversations ultimately led to the development of a unique portal for explori...
James G. Bellingham, Mike Godin
COGSCI
2010
87views more  COGSCI 2010»
13 years 6 months ago
The Logical Problem of Language Acquisition: A Probabilistic Perspective
Natural language is full of patterns that appear to fit with general linguistic rules but are ungrammatical. There has been much debate over how children acquire these ‘‘ling...
Anne S. Hsu, Nick Chater
INFOCOM
2010
IEEE
13 years 6 months ago
Practical Scheduling Algorithms for Concurrent Transmissions in Rate-adaptive Wireless Networks
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
Zhe Yang, Lin Cai, Wu-sheng Lu