Sciweavers

9842 search results - page 1360 / 1969
» Problem complexity
Sort
View
266
Voted
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 9 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
PODC
2003
ACM
16 years 16 days ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...
201
Voted
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
16 years 1 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
232
Voted
KDD
2007
ACM
211views Data Mining» more  KDD 2007»
16 years 7 months ago
Enhanced max margin learning on multimodal data mining in a multimedia database
The problem of multimodal data mining in a multimedia database can be addressed as a structured prediction problem where we learn the mapping from an input to the structured and i...
Zhen Guo, Zhongfei Zhang, Eric P. Xing, Christos F...
229
Voted
VLSID
2004
IEEE
170views VLSI» more  VLSID 2004»
16 years 7 months ago
On-chip networks: A scalable, communication-centric embedded system design paradigm
As chip complexity grows, design productivity boost is expected from reuse of large parts and blocks of previous designs with the design effort largely invested into the new parts...
Jörg Henkel, Srimat T. Chakradhar, Wayne Wolf
« Prev « First page 1360 / 1969 Last » Next »