Sciweavers

801 search results - page 91 / 161
» Minimal Locked Trees
Sort
View
NAACL
2010
14 years 7 months ago
Ensemble Models for Dependency Parsing: Cheap and Good?
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...
Mihai Surdeanu, Christopher D. Manning
ICCAD
1996
IEEE
74views Hardware» more  ICCAD 1996»
15 years 2 months ago
Optimal non-uniform wire-sizing under the Elmore delay model
We consider non-uniform wire-sizing for general routing trees under the Elmore delay model. Three minimization objectives are studied: 1) total weighted sink-delays; 2) total area...
Chung-Ping Chen, Hai Zhou, D. F. Wong
SIGCOMM
1998
ACM
15 years 2 months ago
QoSMIC: Quality of Service Sensitive Multicast Internet Protocol
In this paper, we present, QoSMIC, a multicast protocol for the Internet that supports QoS-sensitive routing, and minimizes the importance of a priori con guration decisions such...
Michalis Faloutsos, Anindo Banerjea, Rajesh Pankaj
ICIP
1999
IEEE
15 years 11 months ago
Adaptive Wavelet-Packet Decomposition for Rate Control of Object Oriented Coding of Video Sequences
A novel object dependent coding scheme based on optimization upon wavelet packet trees is proposed. The method may be employed in the context of object oriented video standard MPE...
Ioannis Stephanakis, Anastasios D. Doulamis, Nikol...
GI
2007
Springer
15 years 4 months ago
On Sensor Scheduling in Case of Unreliable Communication
: This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. In case of the common assumption of an errorfree communication, the...
Marco F. Huber, Eric Stiegeler, Uwe D. Hanebeck