Sciweavers

887 search results - page 146 / 178
» A Time for Choosing
Sort
View
COLT
1999
Springer
14 years 2 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
VLSISP
2002
112views more  VLSISP 2002»
13 years 9 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
SIGIR
2004
ACM
14 years 3 months ago
Resource selection for domain-specific cross-lingual IR
An under-explored question in cross-language information retrieval (CLIR) is to what degree the performance of CLIR methods depends on the availability of high-quality translation...
Monica Rogati, Yiming Yang
ICDCS
2003
IEEE
14 years 3 months ago
QoS-Assured Service Composition in Managed Service Overlay Networks
Many value-added and content delivery services are being offered via service level agreements (SLAs). These services can be interconnected to form a service overlay network (SON) ...
Xiaohui Gu, Klara Nahrstedt, Rong N. Chang, Christ...
ISPAN
2002
IEEE
14 years 2 months ago
Building Ontology for Optimization and Composition of Parallel JavaBean Programs
Abstract— In this paper, we propose an ontology specification for JavaBean programs, the object component model of Java. Our specification is written using the DAML+OIL languag...
Cheng-Wei Chen, Chung-Kai Chen, Jenq Kuen Lee