Sciweavers

1984 search results - page 278 / 397
» The colourful feasibility problem
Sort
View
ASPDAC
2009
ACM
130views Hardware» more  ASPDAC 2009»
16 years 26 days ago
Analog placement with common centroid and 1-D symmetry constraints
— 1In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of pl...
Linfu Xiao, Evangeline F. Y. Young
MOBIWAC
2009
ACM
16 years 25 days ago
MeshScan: fast and efficient handoff in IEEE802.11 mesh networks
Handoff delay is one of the major problems in Wireless Mesh Network (WMN) that needs to be solved in order to allow time-critical and real-time applications run continuously durin...
Yin Chen, Karol Kowalik, Mark Davis
CSE
2008
IEEE
16 years 24 days ago
An Experimental Peer-to-Peer E-mail System
Conventional e-mail systems are prone to problems that affect their dependability. E-mail systems operate following a “push-based” approach: the sender side server pushes the ...
Edson Kageyama, Carlos Maziero, Altair Olivo Santi...
GLOBECOM
2008
IEEE
16 years 24 days ago
An Upper Bound on Network Size in Mobile Ad-Hoc Networks
—In this paper we propose a model to compute an upper bound for the maximum network size in mobile ad-hoc networks. Our model is based on the foundation that for a unicast route ...
Michael Pascoe, Javier Gomez, Victor Rangel, Migue...
ICASSP
2008
IEEE
16 years 24 days ago
Discriminative training by iterative linear programming optimization
In this paper, we cast discriminative training problems into standard linear programming (LP) optimization. Besides being convex and having globally optimal solution(s), LP progra...
Brian Mak, Benny Ng