5144 search results - page 370 / 1029 » Enhancing Search with Structure |
169
click to vote
NPC
2004
Springer
16 years 4 days ago
2004
Springer
In conventional DHTs, each node is assigned an exclusive slice of identifier space. Simple it is, such arrangement may be rough. In this paper we propose a generic component struc...
198
click to vote
COMMA
2008
15 years 8 months ago
2008
Abstract. In previous work, we presented an RDFS ontology, based on the Argument Interchange Format (AIF), for describing arguments and argument schemes. We also implemented a pilo...
157
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
Great stride has been made in psychological research about primitives of visual perception, which is important to computer vision and image processing. In this paper, we propose a...
183
click to vote
ICMCS
2005
IEEE
16 years 11 days ago
2005
IEEE
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
184
click to vote
FOCS
1992
IEEE
15 years 11 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...