Sciweavers

5022 search results - page 149 / 1005
» Data structures and problem solving using Java
Sort
View
ICDE
2005
IEEE
136views Database» more  ICDE 2005»
15 years 11 months ago
Bloom Filter-based XML Packets Filtering for Millions of Path Queries
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
Xueqing Gong, Ying Yan, Weining Qian, Aoying Zhou
VLDB
2001
ACM
168views Database» more  VLDB 2001»
15 years 10 months ago
Answering queries using views: A survey
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessin...
Alon Y. Halevy
MICAI
2004
Springer
15 years 3 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
IJCAI
1989
14 years 11 months ago
Preprocessing Search Spaces for Branch and Bound Search
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
Qiang Yang, Dana S. Nau
GLOBECOM
2008
IEEE
15 years 4 months ago
Joint Power Loading of Data and Pilots in OFDM Using Imperfect Channel State Information at the Transmitter
— The search for optimality in the design of channel precoders and training symbols in block processing communication systems is one of paramount importance. Finding the best tra...
Chitaranjan P. Sukumar, Ricardo Merched, Ahmed M. ...