Sciweavers

1221 search results - page 211 / 245
» Balanced graph partitioning
Sort
View
JAL
1998
85views more  JAL 1998»
13 years 7 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
WEBI
2010
Springer
13 years 5 months ago
Hierarchical Cost-Sensitive Web Resource Acquisition for Record Matching
Web information is increasingly used as evidence in solving various problems, including record matching. However, acquiring web-based resources is slow and can incur other access c...
Yee Fan Tan, Min-Yen Kan
TDSC
2010
172views more  TDSC 2010»
13 years 2 months ago
Proactive Detection of Computer Worms Using Model Checking
Although recent estimates are speaking of 200,000 different viruses, worms, and Trojan horses, the majority of them are variants of previously existing malware. As these variants m...
Johannes Kinder, Stefan Katzenbeisser, Christian S...
ECIR
2011
Springer
12 years 11 months ago
A User-Oriented Model for Expert Finding
Expert finding addresses the problem of retrieving a ranked list of people who are knowledgeable on a given topic. Several models have been proposed to solve this task, but so far...
Elena Smirnova, Krisztian Balog
ECCV
2008
Springer
14 years 6 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee