Sciweavers

4526 search results - page 96 / 906
» Algorithmic problems related to the Internet
Sort
View
CCA
2009
Springer
15 years 8 months ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich
JAIR
2011
134views more  JAIR 2011»
14 years 11 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
JOC
2010
129views more  JOC 2010»
14 years 10 months ago
Discrete Logarithm Problems with Auxiliary Inputs
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
Jung Hee Cheon
ICMCS
2008
IEEE
121views Multimedia» more  ICMCS 2008»
15 years 10 months ago
Online video advertising based on user's attention relavancy computing
Information overload has become an important problem in the internet, and that all kinds of existing ads flood into people’s eyes causes scarcity of user’s attention. To provi...
Jinqiao Wang, Yikai Fang, Hanqing Lu
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
15 years 9 months ago
Multi-unit auctions with budget-constrained bidders
We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense ...
Christian Borgs, Jennifer T. Chayes, Nicole Immorl...