4850 search results - page 206 / 970 » Approximate Data Structures with Applications |
168
Voted
SEFM
2006
IEEE
16 years 11 days ago
2006
IEEE
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
140
click to vote
HICSS
2002
IEEE
15 years 11 months ago
2002
IEEE
As XML is gathering more and more importance in the field of data interchange in distributed business to business (B2B) applications, it is increasingly important to provide a for...
171
click to vote
SDM
2008
SIAM
15 years 7 months ago
2008
SIAM
Sample selection bias is a common problem in many real world applications, where training data are obtained under realistic constraints that make them follow a different distribut...
182
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
In this work we try to bridge the gap often encountered by researchers who find themselves with few or no labeled examples from their desired target domain, yet still have access ...
180
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...