Sciweavers

2479 search results - page 100 / 496
» Random Event Structures
Sort
View
IPM
2007
95views more  IPM 2007»
13 years 8 months ago
Using structural contexts to compress semistructured text collections
We describe a compression model for semistructured documents, called Structural Contexts Model (SCM), which takes advantage of the context information usually implicit in the stru...
Joaquín Adiego, Gonzalo Navarro, Pablo de l...
COMPGEOM
2010
ACM
14 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
INFOCOM
2006
IEEE
14 years 2 months ago
Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
Yong Yang, Rocky Dunlap, Mike Rexroad, Brian F. Co...
CIVR
2008
Springer
127views Image Analysis» more  CIVR 2008»
13 years 10 months ago
Investigating keyframe selection methods in the novel domain of passively captured visual lifelogs
The SenseCam is a passive capture wearable camera, worn around the neck, and when worn continuously it takes an average of 1,900 images per day. It can be used to create a persona...
Aiden R. Doherty, Daragh Byrne, Alan F. Smeaton, G...
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
14 years 9 months ago
Lower bounds for k-DNF resolution on random 3-CNFs
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
Michael Alekhnovich