Sciweavers

1859 search results - page 121 / 372
» Sketch-based path design
Sort
View
SIGCOMM
2006
ACM
14 years 3 months ago
Policy-based routing with non-strict preferences
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
Chi-kin Chau
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
ISPD
2003
ACM
89views Hardware» more  ISPD 2003»
14 years 2 months ago
Local unidirectional bias for smooth cutsize-delay tradeoff in performance-driven bipartitioning
Traditional multilevel partitioning approaches have shown good performance with respect to cutsize, but offer no guarantees with respect to system performance. Timing-driven part...
Andrew B. Kahng, Xu Xu
ICDM
2002
IEEE
173views Data Mining» more  ICDM 2002»
14 years 2 months ago
Mining Genes in DNA Using GeneScout
In this paper, we present a new system, called GeneScout, for predicting gene structures in vertebrate genomic DNA. The system contains specially designed hidden Markov models (HM...
Michael M. Yin, Jason Tsong-Li Wang
ICCCN
1998
IEEE
14 years 1 months ago
A Two-Phase Inter-Switch Handoff Scheme for Wireless ATM Networks
Supporting mobility in Wireless ATM networks poses a number of technical issues. An important issue is the ability to reroute ongoing virtual connections during handoff as mobile ...
Khaled Salah, Elias Drakopoulos