Sciweavers

12597 search results - page 2123 / 2520
» Complexity of Mechanism Design
Sort
View
IPPS
1997
IEEE
15 years 12 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
VLDB
1998
ACM
121views Database» more  VLDB 1998»
15 years 12 months ago
Hash Joins and Hash Teams in Microsoft SQL Server
The query execution engine in Microsoft SQL Server employs hash-based algorithms for inner and outer joins, semi-joins, set operations (such as intersection), grouping, and duplic...
Goetz Graefe, Ross Bunker, Shaun Cooper
HT
1997
ACM
15 years 11 months ago
Workspaces: The HyperDisco Approach to Internet Distribution
Hypermedia concepts are currently being deployed in a variety of information systems such as the World Wide Web, software development environments, large engineering enterprises, ...
Uffe Kock Wiil, John J. Leggett
MOBICOM
1997
ACM
15 years 11 months ago
Composable ad-hoc Mobile Services for Universal Interaction
This paperintroduces the notion of “universalinteraction,” allowing a device to adapt its functionality to exploit services it discovers as it moves into a new environment. Us...
Todd D. Hodes, Randy H. Katz, Edouard Servan-Schre...
ECML
1997
Springer
15 years 11 months ago
Constructing Intermediate Concepts by Decomposition of Real Functions
In learning from examples it is often useful to expand an attribute-vector representation by intermediate concepts. The usual advantage of such structuring of the learning problemi...
Janez Demsar, Blaz Zupan, Marko Bohanec, Ivan Brat...
« Prev « First page 2123 / 2520 Last » Next »