Sciweavers

2087 search results - page 138 / 418
» Computation of class numbers of quadratic number fields
Sort
View
PODS
2005
ACM
86views Database» more  PODS 2005»
15 years 3 months ago
An incremental algorithm for computing ranked full disjunctions
The full disjunction is a variation of the join operator that maximally combines tuples from connected relations, while preserving all information in the relations. The full disju...
Sara Cohen, Yehoshua Sagiv
CORR
2011
Springer
194views Education» more  CORR 2011»
14 years 5 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...
OSDI
2008
ACM
15 years 10 months ago
Predicting Computer System Failures Using Support Vector Machines
Mitigating the impact of computer failure is possible if accurate failure predictions are provided. Resources, applications, and services can be scheduled around predicted failure...
Errin W. Fulp, Glenn A. Fink, Jereme N. Haack
CHI
2010
ACM
15 years 4 months ago
Lumino: tangible blocks for tabletop computers based on glass fiber bundles
Tabletop computers based on diffuse illumination can track fiducial markers placed on the table’s surface. In this paper, we demonstrate how to do the same with objects arranged...
Patrick Baudisch, Torsten Becker, Frederik Rudeck
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
15 years 3 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap