443 search results - page 40 / 89 » More on the Size of Higman-Haines Sets: Effective Constructi... |
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
ESWS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Aiming to build a complete benchmark for better evaluation of existing ontology systems, we extend the well-known Lehigh University Benchmark in terms of inference and sc...
TASLP
2002
13 years 7 months ago
2002
Abstract--We describe some high-level approaches to estimating confidence scores for the words output by a speech recognizer. By "high-level" we mean that the proposed me...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's P...
CGO
2010
IEEE
14 years 2 months ago
2010
IEEE
For memory constrained embedded systems code size is at least as important as performance. One way of increasing code density is to exploit compact instruction formats, e.g. ARM T...