Sciweavers

1381 search results - page 164 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
GRID
2003
Springer
15 years 9 months ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 4 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
PAMI
2007
193views more  PAMI 2007»
15 years 3 months ago
Robust Object Recognition with Cortex-Like Mechanisms
—We introduce a new general framework for the recognition of complex visual scenes, which is motivated by biology: We describe a hierarchical system that closely follows the orga...
Thomas Serre, Lior Wolf, Stanley M. Bileschi, Maxi...
COMPSAC
2002
IEEE
15 years 9 months ago
A Graphically Based Language for Constructing, Executing and Analysing Models of Software Systems
With computer systems becoming ever larger and more complex, the cost and effort associated with their construction is increasing and the systems are now sufficiently complex that...
Robert John Walters
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner