Sciweavers

900 search results - page 120 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
FOCS
1998
IEEE
15 years 7 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
CORR
2010
Springer
155views Education» more  CORR 2010»
14 years 10 months ago
A Complexity View of Markets with Social Influence
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
Xi Chen, Shang-Hua Teng
137
Voted
ICCS
2003
Springer
15 years 8 months ago
Self-Organizing Hybrid Neurofuzzy Networks
Abstract. We introduce a concept of self-organizing Hybrid Neurofuzzy Networks (HNFN), a hybrid modeling architecture combining neurofuzzy (NF) and polynomial neural networks(PNN)....
Sung-Kwun Oh, Su-Chong Joo, Chang-Won Jeong, Hyun-...
128
Voted
DAC
2005
ACM
16 years 4 months ago
An effective power mode transition technique in MTCMOS circuits
- The large magnitude of supply/ground bounces, which arise from power mode transitions in power gating structures, may cause spurious transitions in a circuit. This can result in ...
Afshin Abdollahi, Farzan Fallah, Massoud Pedram
113
Voted
WWW
2010
ACM
15 years 10 months ago
Scalable discovery of contradictions on the web
Our study addresses the problem of large-scale contradiction detection and management, from data extracted from the Web. We describe the first systematic solution to the problem,...
Mikalai Tsytsarau, Themis Palpanas, Kerstin Deneck...