Sciweavers

4908 search results - page 957 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 1 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
AAAI
2006
15 years 1 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
AAAI
2006
15 years 1 months ago
Heuristic Search and Information Visualization Methods for School Redistricting
We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a co...
Marie desJardins, Blazej Bulka, Ryan Carr, Andrew ...
DAGSTUHL
2006
15 years 1 months ago
Cognitive Vision Needs Attention to Link Sensing with Recognition
Abstract. "Cognitive computer vision is concerned with integration and control of vision systems using explicit but not necessarily symbolic models of context, situation and g...
John K. Tsotsos
IJIT
2004
15 years 1 months ago
Modeling of Pulping of Sugar Maple Using Advanced Neural Network Learning
This paper reports work done to improve the modeling of complex processes when only small experimental data sets are available. Neural networks are used to capture the nonlinear un...
W. D. Wan Rosli, Z. Zainuddin, R. Lanouette, S. Sa...