3172 search results - page 77 / 635 » On the Random-Self-Reducibility of Complete Sets |
125
click to vote
VMV
2003
15 years 2 months ago
2003
There are many nearest neighbor algorithms tailormade for ICP, but most of them require special input data like range images or triangle meshes. We focus on efficient nearest nei...
114
Voted
CP
2006
Springer
15 years 4 months ago
2006
Springer
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
111
click to vote
FM
1997
Springer
15 years 5 months ago
1997
Springer
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
105
Voted
ICDT
2007
ACM
15 years 4 months ago
2007
ACM
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
83
Voted
LREC
2008
15 years 2 months ago
2008
In this paper we report on the analyses of alternative approaches to semantic role annotation (FrameNet (FrameNet, 2005), PropBank (Palmer et al., 2005) and VerbNet (Kipper, 2006)...