Sciweavers

4744 search results - page 554 / 949
» Connected Computing
Sort
View
195
Voted
IGPL
1998
97views more  IGPL 1998»
15 years 7 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
206
Voted
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
15 years 7 months ago
A Case for Intelligent Disks (IDISKs)
Abstract: Decision support systems (DSS) and data warehousing workloads comprise an increasing fraction of the database market today. I/O capacity and associated processing require...
Kimberly Keeton, David A. Patterson, Joseph M. Hel...
TCS
2010
15 years 5 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer
PERCOM
2010
ACM
15 years 5 months ago
Profiling sprints using on-body sensors
This paper describes the design, implementation and deployment of a wireless sensor system for athletes. The system is designed to profile sprints based on input from on-body senso...
Salman Taherian, Marcelo Pias, Robert Harle, Georg...
245
Voted
NETWORKS
2011
15 years 2 months ago
On cut-based inequalities for capacitated network design polyhedra
In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
Christian Raack, Arie M. C. A. Koster, Sebastian O...