Sciweavers

10271 search results - page 1632 / 2055
» Computer Science
Sort
View
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 7 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
ICALP
2009
Springer
16 years 7 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
SIGMOD
2008
ACM
179views Database» more  SIGMOD 2008»
16 years 7 months ago
BibNetMiner: mining bibliographic information networks
Online bibliographic databases, such as DBLP in computer science and PubMed in medical sciences, contain abundant information about research publications in different fields. Each...
Yizhou Sun, Tianyi Wu, Zhijun Yin, Hong Cheng, Jia...
SIGMOD
2004
ACM
209views Database» more  SIGMOD 2004»
16 years 7 months ago
MAIDS: Mining Alarming Incidents from Data Streams
Real-time surveillance systems, network and telecommunication systems, and other dynamic processes often generate tremendous (potentially infinite) volume of stream data. Effectiv...
Y. Dora Cai, David Clutter, Greg Pape, Jiawei Han,...
SDM
2009
SIAM
180views Data Mining» more  SDM 2009»
16 years 4 months ago
Hierarchical Linear Discriminant Analysis for Beamforming.
This paper demonstrates the applicability of the recently proposed supervised dimension reduction, hierarchical linear discriminant analysis (h-LDA) to a well-known spatial locali...
Barry L. Drake, Haesun Park, Jaegul Choo
« Prev « First page 1632 / 2055 Last » Next »