Sciweavers

1772 search results - page 177 / 355
» Classifying Problems into Complexity Classes
Sort
View
ISB
2002
140views more  ISB 2002»
15 years 20 days ago
Computer system "Gene Discovery" for promoter structure analysis
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
Eugenii E. Vityaev, Yuri L. Orlov, Oleg V. Vishnev...
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
15 years 7 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
IPSN
2005
Springer
15 years 6 months ago
Coverage and hole-detection in sensor networks via homology
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
Robert Ghrist, Abubakr Muhammad
FCS
2006
15 years 2 months ago
The Representational Power of Conjunctive Normal Form
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
Thomas O'Neil, Jason Smith
MP
2007
95views more  MP 2007»
15 years 15 days ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking