Sciweavers

2343 search results - page 442 / 469
» Structure and Interpretation of Computer Programs
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 6 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
COORDINATION
2009
Springer
16 years 3 months ago
Enhanced Coordination in Sensor Networks through Flexible Service Provisioning
: Heterogeneous wireless sensor networks represent a challenging programming environment. Servilla addresses this by offering a new middleware framework that provides service provi...
Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu
IPPS
2009
IEEE
15 years 9 months ago
Annotation-based empirical performance tuning using Orio
In many scientific applications, significant time is spent tuning codes for a particular highperformance architecture. Tuning approaches range from the relatively nonintrusive (...
Albert Hartono, Boyana Norris, Ponnuswamy Sadayapp...
CHI
2004
ACM
15 years 8 months ago
Topobo: a constructive assembly system with kinetic memory
We introduce Topobo, a 3D constructive assembly system embedded with kinetic memory, the ability to record and playback physical motion. Unique among modeling systems is Topoboʼs...
Hayes Raffle, Amanda J. Parkes, Hiroshi Ishii
FOCS
1998
IEEE
15 years 6 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello