Sciweavers

715 search results - page 88 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
AAAI
2010
13 years 10 months ago
Constraint Programming for Data Mining and Machine Learning
Machine learning and data mining have become aware that using constraints when learning patterns and rules can be very useful. To this end, a large number of special purpose syste...
Luc De Raedt, Tias Guns, Siegfried Nijssen
NIPS
2004
13 years 10 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 10 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
ICDE
2010
IEEE
206views Database» more  ICDE 2010»
13 years 10 months ago
HECATAEUS: Regulating Schema Evolution
HECATAEUS is an open-source software tool for enabling impact prediction, what-if analysis, and regulation of relational database schema evolution. We follow a graph theoretic appr...
George Papastefanatos, Panos Vassiliadis, Alkis Si...
ICC
2008
IEEE
125views Communications» more  ICC 2008»
14 years 3 months ago
Asymptotic Performance of DS-CDMA with Linear MMSE Receiver and Limited Feedback
Abstract—Signature quantization for reverse-link Direct Sequence (DS)- Code Division Multiple Access (CDMA) is considered. A receiver assumed to have perfect estimates of channel...
Wiroonsak Santipach