Sciweavers

10602 search results - page 1967 / 2121
» Weakly Useful Sequences
Sort
View
187
Voted
KDD
2002
ACM
147views Data Mining» more  KDD 2002»
16 years 7 months ago
Sequential cost-sensitive decision making with reinforcement learning
Recently, there has been increasing interest in the issues of cost-sensitive learning and decision making in a variety of applications of data mining. A number of approaches have ...
Edwin P. D. Pednault, Naoki Abe, Bianca Zadrozny
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 7 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
16 years 7 months ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein
202
Voted
OSDI
2004
ACM
16 years 7 months ago
Automated Worm Fingerprinting
Network worms are a clear and growing threat to the security of today's Internet-connected hosts and networks. The combination of the Internet's unrestricted connectivit...
Sumeet Singh, Cristian Estan, George Varghese, Ste...
205
Voted
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
16 years 7 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
« Prev « First page 1967 / 2121 Last » Next »