Sciweavers

603 search results - page 71 / 121
» A General Approximation Technique for Constrained Forest Pro...
Sort
View
IUI
2006
ACM
15 years 5 months ago
Splitting rules for graceful degradation of user interfaces
This paper addresses the problem of the graceful degradation of user interfaces where an initial interface is transferred to a smaller platform. It presents a technique for pagina...
Murielle Florins, Francisco Montero Simarro, Jean ...
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 4 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
ALT
2004
Springer
15 years 8 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
15 years 28 days ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder
CORR
2010
Springer
147views Education» more  CORR 2010»
14 years 12 months ago
Single Parameter Combinatorial Auctions with Partially Public Valuations
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
Gagan Goel, Chinmay Karande, Lei Wang