5022 search results - page 244 / 1005 » Data structures and problem solving using Java |
107
Voted
MP
2008
15 years 2 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
122
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
119
Voted
OTM
2010
Springer
15 years 13 days ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
132
Voted
CIKM
2009
Springer
15 years 5 months ago
2009
Springer
Supporting semantic queries in relational databases is essential to many advanced applications. Recently, with the increasing use of ontology in various applications, the need for...
182
click to vote
SDM
2011
SIAM
14 years 5 months ago
2011
SIAM
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...