Sciweavers

2252 search results - page 365 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
GBRPR
2007
Springer
14 years 3 months ago
Hierarchy Construction Schemes Within the Scale Set Framework
Segmentation algorithms based on an energy minimisation framework often depend on a scale parameter which balances a fit to data and a regularising term. Irregular pyramids are de...
Jean-Hugues Pruvot, Luc Brun
MSN
2007
Springer
110views Sensor Networks» more  MSN 2007»
14 years 3 months ago
A Location Aided Flooding Protocol for Wireless Ad Hoc Networks
Flooding in wireless ad hoc networks is a fundamental and critical operation in supporting various applications and protocols. However, the traditional flooding scheme generates ex...
Xinxin Liu, Xiaohua Jia, Hai Liu, Li Feng
ICPADS
2006
IEEE
14 years 3 months ago
Fast Convergence in Self-Stabilizing Wireless Networks
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
Nathalie Mitton, Eric Fleury, Isabelle Guér...
CLUSTER
2005
IEEE
14 years 2 months ago
Search-based Job Scheduling for Parallel Computer Workloads
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...
Sangsuree Vasupongayya, Su-Hui Chiang, B. Massey
ISPD
2005
ACM
153views Hardware» more  ISPD 2005»
14 years 2 months ago
Evaluation of placer suboptimality via zero-change netlist transformations
In this paper we introduce the concept of zero-change transformations to quantify the suboptimality of existing placers. Given a netlist and its placement from a placer, we formal...
Andrew B. Kahng, Sherief Reda