Sciweavers

266 search results - page 44 / 54
» Is Combining Classifiers Better than Selecting the Best One
Sort
View
PVLDB
2010
103views more  PVLDB 2010»
13 years 6 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
14 years 9 months ago
Stop Chasing Trends: Discovering High Order Models in Evolving Data
Abstract-- Many applications are driven by evolving data -patterns in web traffic, program execution traces, network event logs, etc., are often non-stationary. Building prediction...
Shixi Chen, Haixun Wang, Shuigeng Zhou, Philip S. ...
GLOBECOM
2007
IEEE
14 years 2 months ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu
IMA
2005
Springer
71views Cryptology» more  IMA 2005»
14 years 1 months ago
Concrete Security of the Blum-Blum-Shub Pseudorandom Generator
Abstract. The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and Vazirani, who proved independently that O(log...
Andrey Sidorenko, Berry Schoenmakers
CF
2006
ACM
14 years 1 months ago
Kilo-instruction processors, runahead and prefetching
There is a continuous research effort devoted to overcome the memory wall problem. Prefetching is one of the most frequently used techniques. A prefetch mechanism anticipates the ...
Tanausú Ramírez, Alex Pajuelo, Olive...