Sciweavers

5022 search results - page 365 / 1005
» Data structures and problem solving using Java
Sort
View
IJCAI
2001
15 years 8 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
BMCBI
2010
106views more  BMCBI 2010»
15 years 6 months ago
Multiple structure alignment and consensus identification for proteins
Background: An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus (pseudo) protein which captures common substructu...
Ivaylo Ilinkin, Jieping Ye, Ravi Janardan
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 11 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
ICIP
2001
IEEE
16 years 8 months ago
Indoor vs outdoor classification of consumer photographs using low-level and semantic features
Scene categorization to indoor vs outdoor may be approached by using low-level features for inferring high-level information about the image. Low-level features such as color and ...
Jiebo Luo, Andreas E. Savakis
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 6 months ago
Constraint solvers: An empirical evaluation of design decisions
This paper presents an evaluation of the design decisions made in four state-of-the-art constraint solvers; Choco, ECLiPSe, Gecode, and Minion. To assess the impact of design deci...
Lars Kotthoff