Sciweavers

1242 search results - page 217 / 249
» The Theory of Grammar Constraints
Sort
View
ICASSP
2011
IEEE
13 years 5 days ago
Sensing-aware classification with high-dimensional data
In many applications decisions must be made about the state of an object based on indirect noisy observation of highdimensional data. An example is the determination of the presen...
Burkay Orten, Prakash Ishwar, W. Clem Karl, Venkat...
INFOCOM
2012
IEEE
11 years 11 months ago
Achievable transmission capacity of cognitive mesh networks with different media access control
—Spectrum sharing is an emerging mechanism to resolve the conflict between the spectrum scarcity and the growing demands for the wireless broadband access. In this paper we inve...
Tao Jing, Xiuying Chen, Yan Huo, Xiuzhen Cheng
ICDT
2012
ACM
247views Database» more  ICDT 2012»
11 years 11 months ago
A normal form for preventing redundant tuples in relational databases
We introduce a new normal form, called essential tuple normal form (ETNF), for relations in a relational database where the constraints are given by functional dependencies and jo...
Hugh Darwen, C. J. Date, Ronald Fagin
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 8 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
FOCS
2009
IEEE
14 years 3 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...