32545 search results - page 276 / 6509 » Data Structures and Algorithms |
265
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
131
click to vote
CSC
2008
15 years 5 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
120
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
135
click to vote
ALENEX
2007
15 years 5 months ago
2007
Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...
231
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Radio Frequency Identification (RFID) applications are set to play an essential role in object tracking and supply chain management systems. In the near future, it is expected tha...