Sciweavers

3341 search results - page 332 / 669
» On Bounded Queries and Approximation
Sort
View
CIKM
2009
Springer
15 years 10 months ago
Effective, design-independent XML keyword search
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
Arash Termehchy, Marianne Winslett
JSS
2010
208views more  JSS 2010»
15 years 5 months ago
Performance analysis of opportunistic broadcast for delay-tolerant wireless sensor networks
This paper investigates a class of mobile wireless sensor networks that are unconnected most of the times; we refer to them as delay–tolerant wireless sensor networks (DTWSN). T...
Abbas Nayebi, Hamid Sarbazi-Azad, Gunnar Karlsson
CCCG
2009
15 years 7 months ago
Data Structures for Range Aggregation by Categories
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
Saladi Rahul, Prosenjit Gupta, K. S. Rajan
CORR
2008
Springer
122views Education» more  CORR 2008»
15 years 6 months ago
Breaking One-Round Key-Agreement Protocols in the Random Oracle Model
In this work we deal with one-round key-agreement protocols, called Merkle's Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a rando...
Miroslava Sotáková
DEXA
1995
Springer
126views Database» more  DEXA 1995»
15 years 10 months ago
A Heuristic Approach for Optimization of Path Expressions
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
Cetin Ozkan, Asuman Dogac, Cem Evrendilek