Sciweavers

6142 search results - page 150 / 1229
» The Complexity of Partition Functions
Sort
View
OPODIS
2007
14 years 11 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...
CIKM
2008
Springer
15 years 2 days ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
DATAMINE
2007
110views more  DATAMINE 2007»
14 years 10 months ago
The complexity of non-hierarchical clustering with instance and cluster level constraints
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
Ian Davidson, S. S. Ravi
MICCAI
2006
Springer
15 years 11 months ago
A New Cortical Surface Parcellation Model and Its Automatic Implementation
In this paper, we present an original method that aims at parcellating the cortical surface in regions functionally meaningful, from individual anatomy. The parcellation is obtaine...
Cédric Clouchoux, Olivier Coulon, Jean-Luc ...
IPMU
2010
Springer
14 years 8 months ago
Constructing Multiple Frames of Discernment for Multiple Subproblems
In this paper we extend a methodology for constructing a frame of discernment from belief functions for one problem, into a methodology for constructing multiple frames of discernm...
Johan Schubert