Sciweavers

371 search results - page 51 / 75
» Algorithms for phylogenetic footprinting
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 5 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
14 years 2 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
PERVASIVE
2011
Springer
12 years 11 months ago
Identifying Important Places in People's Lives from Cellular Network Data
People spend most of their time at a few key locations, such as home and work. Being able to identify how the movements of people cluster around these “important places” is cru...
Sibren Isaacman, Richard Becker, Ramón C&aa...
STOC
1996
ACM
92views Algorithms» more  STOC 1996»
14 years 18 days ago
Constructing Evolutionary Trees in the Presence of Polymorphic Characters
Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
Maria Luisa Bonet, Cynthia A. Phillips, Tandy Warn...
WABI
2009
Springer
127views Bioinformatics» more  WABI 2009»
14 years 3 months ago
Constructing Majority-Rule Supertrees
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
Jianrong Dong, David Fernández-Baca, Fred R...