Sciweavers

511 search results - page 94 / 103
» TSP with bounded metrics
Sort
View
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
14 years 1 months ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond
INFOCOM
1999
IEEE
14 years 22 days ago
Ring versus Tree Embedding for Real-time Group Multicast
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
Mario Baldi, Yoram Ofek
ICDAR
1995
IEEE
14 years 5 min ago
Semi-automatic delineation of regions in floor plans
We propose a technique that makes use of a proximity metric for delineating partially or fully bounded regions of a scanned bitmap that depicts a building floor plan. A proximity...
Kathy Ryall, Stuart M. Shieber, Joe Marks, Murray ...
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
14 years 9 months ago
Integrality gaps for Sherali-Adams relaxations
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
Moses Charikar, Konstantin Makarychev, Yury Makary...
KDD
2001
ACM
118views Data Mining» more  KDD 2001»
14 years 8 months ago
Infominer: mining surprising periodic patterns
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
Jiong Yang, Wei Wang 0010, Philip S. Yu