Sciweavers

2875 search results - page 290 / 575
» Information Retrieval in Structured Domains
Sort
View
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 7 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
JCDL
2006
ACM
237views Education» more  JCDL 2006»
16 years 18 days ago
Automatic extraction of table metadata from digital documents
Tables are used to present, list, summarize, and structure important data in documents. In scholarly articles, they are often used to present the relationships among data and high...
Ying Liu, Prasenjit Mitra, C. Lee Giles, Kun Bai
CIKM
2011
Springer
14 years 6 months ago
Integrating and querying web databases and documents
There exist many interrelated information sources on the Internet that can be categorized into structured (database) and semistructured (documents). A key challenge is to integrat...
Carlos Garcia-Alvarado, Carlos Ordonez
COORDINATION
2004
Springer
16 years 1 days ago
O'Klaim: A Coordination Language with Mobile Mixins
This paper presents O’KLAIM (Object-Oriented KLAIM), a linguistic extension of the higher-order calculus for mobile processes KLAIM with objectoriented features. Processes intera...
Lorenzo Bettini, Viviana Bono, Betti Venneri
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud