Sciweavers

1260 search results - page 189 / 252
» Bipolar Preference Problems
Sort
View
PKDD
2005
Springer
89views Data Mining» more  PKDD 2005»
15 years 3 months ago
Community Mining from Multi-relational Networks
Abstract. Social network analysis has attracted much attention in recent years. Community mining is one of the major directions in social network analysis. Most of the existing met...
Deng Cai, Zheng Shao, Xiaofei He, Xifeng Yan, Jiaw...
ARCS
2004
Springer
15 years 3 months ago
Latent Semantic Indexing in Peer-to-Peer Networks
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...
Xuezheng Liu, Ming Chen, Guangwen Yang
DSMML
2004
Springer
15 years 3 months ago
Redundant Bit Vectors for Quickly Searching High-Dimensional Regions
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
Jonathan Goldstein, John C. Platt, Christopher J. ...
ICGI
2004
Springer
15 years 3 months ago
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA
State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, ...
John Abela, François Coste, Sandro Spina
IMR
2004
Springer
15 years 3 months ago
Mark-It: A Marking User Interface for Cutting Decomposition Time
We present Mark-It, a marking user interface that reduced the time to decompose a set of CAD models exhibiting a range of decomposition problems by as much as fifty percent. Inst...
Nicholas C. Yang, Andrew S. Forsberg, Jason F. She...