Sciweavers

5539 search results - page 23 / 1108
» What can be computed locally
Sort
View
ICGI
2010
Springer
13 years 8 months ago
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
Sophia Katrenko, Menno van Zaanen
MSWIM
2006
ACM
14 years 3 months ago
Establishing how many VoIP calls a wireless LAN can support without performance degradation
The use of Voice IP (VoIP) over wireless local area networks (WLAN) is a topic of great interest in the research arena. This paper attempts to answer the question: how many VoIP c...
Ángel Cuevas Rumín, Eur Ing Chris Gu...
BMCBI
2006
114views more  BMCBI 2006»
13 years 10 months ago
Evaluation and comparison of mammalian subcellular localization prediction methods
Background: Determination of the subcellular location of a protein is essential to understanding its biochemical function. This information can provide insight into the function o...
Josefine Sprenger, J. Lynn Fink, Rohan D. Teasdale
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
12 years 8 days ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
ECCV
1994
Springer
14 years 11 months ago
Non-parametric Local Transforms for Computing Visual Correspondence
Abstract. We propose a new approach to the correspondence problem that makes use of non-parametric local transforms as the basis for correlation. Non-parametric local transforms re...
Ramin Zabih, John Woodfill