Sciweavers

1095 search results - page 86 / 219
» Preprocessing of Intractable Problems
Sort
View
CCCG
2006
13 years 11 months ago
Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts
In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the o...
R. Sharathkumar, Prosenjit Gupta
AAAI
1996
13 years 11 months ago
Agent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction
A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...
Peggy S. Eaton, Eugene C. Freuder
CORR
2002
Springer
144views Education» more  CORR 2002»
13 years 10 months ago
Polynomial Time Data Reduction for Dominating Set
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
Jochen Alber, Michael R. Fellows, Rolf Niedermeier
ICASSP
2011
IEEE
13 years 1 months ago
Classification by weighting for spatio-frequency components of EEG signal during motor imagery
We propose a novel method for the classification of EEG signals during motor-imagery. For motor-imagery based brain computer interface (MI-BCI), a method called common spatial pa...
Hiroshi Higashi, Toshihisa Tanaka
ICDT
2009
ACM
149views Database» more  ICDT 2009»
14 years 11 months ago
Query languages for data exchange: beyond unions of conjunctive queries
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
Juan Reutter, Marcelo Arenas, Pablo Barceló