Sciweavers

1995 search results - page 7 / 399
» What's the Problem
Sort
View
SYNTHESE
2010
70views more  SYNTHESE 2010»
13 years 5 months ago
What ought probably means, and why you can't detach it
: Some intuitive normative principles raise vexing „detaching problems‟ by their failure to license modus ponens. I examine three such principles (a self-reliance principle and...
Stephen Finlay
VLDB
2000
ACM
166views Database» more  VLDB 2000»
13 years 11 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
IWPEC
2009
Springer
14 years 1 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
AAAI
2008
13 years 9 months ago
What Is Answer Set Programming?
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in k...
Vladimir Lifschitz
CVPR
2010
IEEE
13 years 9 months ago
Proximate Sensing: Inferring What-Is-Where From Georeferenced Photo Collections
The primary and novel contribution of this work is the conjecture that large collections of georeferenced photo collections can be used to derive maps of what-is-where on the surf...
Daniel Leung, Shawn Newsam