Sciweavers

2434 search results - page 231 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
ICDE
2008
IEEE
133views Database» more  ICDE 2008»
15 years 10 months ago
Discovering popular co-cited communities in blogspaces
In a blogspace, citation behaviors reflect interests of bloggers. To fully get insight into the latent information in a blogspace, in this paper, we intend to mine popular co-cit...
Meng-Fen Chiang, Wen-Chih Peng, Chia-Hao Lo
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 4 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
EOR
2010
88views more  EOR 2010»
15 years 4 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan
ICML
2006
IEEE
16 years 5 months ago
Combined central and subspace clustering for computer vision applications
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
Le Lu, René Vidal
RECOMB
2006
Springer
16 years 4 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...