Sciweavers

514 search results - page 93 / 103
» On the Structure of Valiant's Complexity Classes
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 11 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
ALT
2003
Springer
13 years 11 months ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini
JISBD
2001
13 years 8 months ago
Conceptual Modeling of Device-Independent Web Applications
Existing tools intended to build and deploy engaging complex Web sites (including functionality) have shown to be inadequate to face the software production process in an unified a...
Jaime Gómez, Cristina Cachero
SBBD
2004
119views Database» more  SBBD 2004»
13 years 8 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
DAGSTUHL
1996
13 years 8 months ago
A Uniform Approach for Compile-Time and Run-Time Specialization
As partial evaluation gets more mature, it is now possible to use this program transformation technique to tackle realistic languages and real-size application programs. However, t...
Charles Consel, Luke Hornof, François No&eu...