Sciweavers

276 search results - page 9 / 56
» Quantifying Homology Classes
Sort
View
AAAI
2004
13 years 9 months ago
Collapsibility and Consistency in Quantified Constraint Satisfaction
The concept of consistency has pervaded studies of the constraint satisfaction problem. We introduce two concepts, which are inspired by consistency, for the more general framewor...
Hubie Chen
GLOBECOM
2010
IEEE
13 years 5 months ago
Capability and Fidelity of Mote-Class Wireless Sniffers
Abstract--Monitoring the health of a sensor network is important for maintaining the health and normal operation of the network. For large-scale cost-effective monitoring, using in...
Jordan Cote, Bing Wang, Wei Zeng, Zhijie Shi
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 7 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
LATA
2010
Springer
14 years 5 months ago
Untestable Properties Expressible with Four First-Order Quantifiers
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
Charles Jordan and Thomas Zeugmann
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
14 years 1 months ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei