Sciweavers

36 search results - page 7 / 8
» New upper bound formulas with parameters for Ramsey numbers
Sort
View
ICB
2007
Springer
79views Biometrics» more  ICB 2007»
14 years 1 months ago
On Some Performance Indices for Biometric Identification System
This paper investigates a new approach to formulate performance indices of biometric system using information theoretic models. The performance indices proposed here (unlike conven...
Jay Bhatnagar, Ajay Kumar
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 7 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 9 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
11 years 9 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
13 years 11 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...