Sciweavers

2043 search results - page 372 / 409
» Some Basics on Tolerances
Sort
View
LATIN
2010
Springer
15 years 4 months ago
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
MohammadTaghi Hajiaghayi, Arefeh A. Nasri
ISCC
2002
IEEE
120views Communications» more  ISCC 2002»
15 years 4 months ago
UMTS-TDD: a solution for internetworking Bluetooth piconets in indoor environments
–– The last few years have seen the evolution of telecommunications from the classic architectures, mainly based on static and wired structures, to the new mobile solutions bas...
Mario Gerla, Yeng-Zhong Lee, Rohit Kapoor, Ted Tae...
LICS
2002
IEEE
15 years 4 months ago
Little Engines of Proof
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
Natarajan Shankar
MICRO
2002
IEEE
127views Hardware» more  MICRO 2002»
15 years 4 months ago
DELI: a new run-time control point
The Dynamic Execution Layer Interface (DELI) offers the following unique capability: it provides fine-grain control over the execution of programs, by allowing its clients to obse...
Giuseppe Desoli, Nikolay Mateev, Evelyn Duesterwal...
SIGMOD
2009
ACM
165views Database» more  SIGMOD 2009»
15 years 4 months ago
Query by output
It has recently been asserted that the usability of a database is as important as its capability. Understanding the database schema, the hidden relationships among attributes in t...
Quoc Trung Tran, Chee-Yong Chan, Srinivasan Partha...