Sciweavers

4242 search results - page 658 / 849
» An Event Spacing Experiment
Sort
View
WAIM
2004
Springer
14 years 3 months ago
Learning-Based Top-N Selection Query Evaluation over Relational Databases
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
Liang Zhu, Weiyi Meng
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
14 years 3 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
CHI
2010
ACM
14 years 3 months ago
Cooking with robots: designing a household system working in open environments
We propose a cooking system that operates in an open environment. The system cooks a meal by pouring various ingredients into a boiling pot on an induction heating cooker and adju...
Yuta Sugiura, Daisuke Sakamoto, Anusha Indrajith W...
C5
2003
IEEE
14 years 3 months ago
Croquet - A Collaboration System Architecture
1 Croquet [18] is a computer software architecture built from the ground up with a focus on deep collaboration between teams of users. It is a totally open, totally free, highly p...
David A. Smith, Alan C. Kay, Andreas Raab, David P...
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
14 years 3 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston