Sciweavers

2260 search results - page 384 / 452
» A new algorithm for clustering search results
Sort
View
AINA
2005
IEEE
14 years 1 months ago
iHITS: Extending HITS for Personal Interests Profiling
Ever since the boom of World Wide Web, profiling online users' interests has become an important task for content providers. The traditional approach involves manual entry of...
Ziming Zhuang
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
EDBT
2008
ACM
128views Database» more  EDBT 2008»
14 years 7 months ago
Processing transitive nearest-neighbor queries in multi-channel access environments
Wireless broadcast is an efficient way for information dissemination due to its good scalability [10]. Existing works typically assume mobile devices, such as cell phones and PDAs...
Xiao Zhang, Wang-Chien Lee, Prasenjit Mitra, Baihu...
CGF
2008
182views more  CGF 2008»
13 years 7 months ago
Lazy Solid Texture Synthesis
Existing solid texture synthesis algorithms generate a full volume of color content from a set of 2D example images. We introduce a new algorithm with the unique ability to restri...
Yue Dong, Sylvain Lefebvre, Xin Tong, George Drett...
CAV
2010
Springer
194views Hardware» more  CAV 2010»
13 years 11 months ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber