Sciweavers

1355 search results - page 191 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
14 years 6 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang
MM
2004
ACM
106views Multimedia» more  MM 2004»
14 years 2 months ago
Probabilistic delay guarantees using delay distribution measurement
Carriers increasingly differentiate their wide-area connectivity offerings by means of customized services, such as virtual private networks (VPN) with Quality of Service (QoS) g...
Kartik Gopalan, Tzi-cker Chiueh, Yow-Jian Lin
MICRO
1991
IEEE
85views Hardware» more  MICRO 1991»
14 years 15 days ago
Comparing Static and Dynamic Code Scheduling for Multiple-Instruction-Issue Processors
This paper examines two alternative approaches to supporting code scheduling for multiple-instruction-issue processors. One is to provide a set of non-trapping instructions so tha...
Pohua P. Chang, William Y. Chen, Scott A. Mahlke, ...
COMCOM
2004
90views more  COMCOM 2004»
13 years 8 months ago
Understanding bandwidth-delay product in mobile ad hoc networks
Bandwidth-delay product (BDP) and its upper bound (BDP-UB) have been well-understood in wireline networks such as the Internet. However, they have not been carefully studied in th...
Kai Chen, Yuan Xue, Samarth H. Shah, Klara Nahrste...
CVPR
2009
IEEE
15 years 4 months ago
Efficient Scale Space Auto-Context for Image Segmentation and Labeling
The Conditional Random Fields (CRF) model, using patch-based classification bound with context information, has recently been widely adopted for image segmentation/ labeling. In...
Jiayan Jiang (UCLA), Zhuowen Tu (UCLA)