1477 search results - page 114 / 296 » On Graph Problems in a Semi-streaming Model |
112
Voted
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
98
Voted
FSTTCS
2008
Springer
14 years 11 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
CVPR
2008
IEEE
16 years 7 days ago
2008
IEEE
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...
104
Voted
MLDM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
92
Voted
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...