Sciweavers

973 search results - page 96 / 195
» New Bounds on Crossing Numbers
Sort
View
ECCC
2010
80views more  ECCC 2010»
14 years 12 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
KDD
2008
ACM
116views Data Mining» more  KDD 2008»
16 years 9 days ago
Volatile correlation computation: a checkpoint view
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
Wenjun Zhou, Hui Xiong
WINE
2009
Springer
178views Economy» more  WINE 2009»
15 years 6 months ago
The Geometry of Truthfulness
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
Angelina Vidali
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
15 years 6 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
JOI
2011
140views more  JOI 2011»
14 years 6 months ago
A bibliometric index based on the collaboration distance between cited and citing authors
The popular h-index used to measure scientific output can be described in terms of a pool of evaluated objects (the papers), a quality function on the evaluated objects (the numb...
Maria Bras-Amorós, Josep Domingo-Ferrer, Vi...