Sciweavers

1740 search results - page 209 / 348
» Minimal structures for stories
Sort
View
ACL
2006
15 years 5 months ago
Minimum Risk Annealing for Training Log-Linear Models
When training the parameters for a natural language system, one would prefer to minimize 1-best loss (error) on an evaluation set. Since the error surface for many natural languag...
David A. Smith, Jason Eisner
CORR
2010
Springer
86views Education» more  CORR 2010»
15 years 4 months ago
Online Scheduling on Identical Machines using SRPT
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Kyle Fox, Benjamin Moseley
COMGEO
1999
ACM
15 years 3 months ago
Multiresolution hierarchies on unstructured triangle meshes
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
Leif Kobbelt, Jens Vorsatz, Hans-Peter Seidel
PVLDB
2010
118views more  PVLDB 2010»
15 years 2 months ago
Ten Thousand SQLs: Parallel Keyword Queries Computing
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
Lu Qin, Jefferey Yu, Lijun Chang
GLOBECOM
2010
IEEE
15 years 1 months ago
A Controlled Coalitional Game for Wireless Connection Sharing and Bandwidth Allocation in Mobile Social Networks
Mobile social networks have been introduced as a new efficient (i.e., minimize resource usage) and effective (i.e., maximize the number of target recipients) way to disseminate con...
Dusit Niyato, Zhu Han, Walid Saad, Are Hjør...