Sciweavers

4266 search results - page 653 / 854
» The container loading problem
Sort
View
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
14 years 1 months ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek
APWEB
2005
Springer
14 years 1 months ago
Mining Quantitative Associations in Large Database
Association Rule Mining algorithms operate on a data matrix to derive association rule, discarding the quantities of the items, which contains valuable information. In order to mak...
Chenyong Hu, Yongji Wang, Benyu Zhang, Qiang Yang,...
AVBPA
2005
Springer
238views Biometrics» more  AVBPA 2005»
14 years 1 months ago
Modelling the Time-Variant Covariates for Gait Recognition
This paper deals with a problem of recognition by gait when time-dependent covariates are added, i.e. when 6 months have passed between recording of the gallery and the probe sets....
Galina V. Veres, Mark S. Nixon, John N. Carter
CAISE
2005
Springer
14 years 1 months ago
Integrating Unnormalised Semi-structured Data Sources
From Proc. CAiSE05 LNCS 3520, Pages 460-474 c Springer-Verlag 2005 Semi-structured data sources, such as XML, HTML or CSV files, present special problems when performing data int...
Sasivimol Kittivoravitkul, Peter McBrien
CRYPTO
2005
Springer
96views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Privacy-Preserving Set Operations
In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private i...
Lea Kissner, Dawn Xiaodong Song