Sciweavers

1968 search results - page 365 / 394
» The Complexity of Valued Constraint Models
Sort
View
BIBE
2006
IEEE
138views Bioinformatics» more  BIBE 2006»
14 years 2 months ago
Assigning Schema Labels Using Ontology And Hueristics
Bioinformatics data is growing at a phenomenal rate. Besides the exponential growth of individual databases, the number of data depositories is increasing too. Because of the comp...
Xuan Zhang, Ruoming Jin, Gagan Agrawal
SIGECOM
2003
ACM
174views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
Collaboration software to reduce inventory and increase response
Some recent trends in business and manufacturing hold the promise of greater profits, yet, due to profit-robbing inventory increases, this promise has not been fully realized. [9]...
Indu Bingham, Barbara Hoefle, Kim Phan, Jim Sizemo...
LCPC
2009
Springer
14 years 1 months ago
Using the Meeting Graph Framework to Minimise Kernel Loop Unrolling for Scheduled Loops
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
Mounira Bachir, David Gregg, Sid Ahmed Ali Touati
SIGMOD
1996
ACM
99views Database» more  SIGMOD 1996»
14 years 17 days ago
A Query Language for Multidimensional Arrays: Design, Implementation, and Optimization Techniques
While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data...
Leonid Libkin, Rona Machlin, Limsoon Wong
FOCS
2004
IEEE
14 years 4 days ago
Shuffling by Semi-Random Transpositions
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
Elchanan Mossel, Yuval Peres, Alistair Sinclair