Sciweavers

9572 search results - page 260 / 1915
» Cover Algorithms and Their Combination
Sort
View
INFOCOM
2002
IEEE
15 years 11 months ago
Guaranteed Scheduling for Switches with Configuration Overhead
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
Brian Towles, William J. Dally
WORDS
2002
IEEE
15 years 11 months ago
Deriving Interaction-Prone Scenarios in Feature Interaction Filtering with Use Case Maps
Feature interactions (FIs, in short) occur when features of different communication services interfere with each other. The FI filtering is a pre-processing before the FI detecti...
Masahide Nakamura, Pattara Leelaprute, Tohru Kikun...
NAACL
2001
15 years 8 months ago
Knowledge-Free Induction of Inflectional Morphologies
We propose an algorithm to automatically induce the morphology of inflectional languages using only text corpora and no human input. Our algorithm combines cues from orthography, ...
Patrick Schone, Daniel Jurafsky

Book
411views
17 years 4 months ago
Concrete Abstractions
"This book has evolved from materials used in an undergraduate course intended for final year undergraduate students whose background includes at least one year's experie...
Max Hailperin, Barbara Kaiser, and Karl Knight
EDBT
2004
ACM
133views Database» more  EDBT 2004»
16 years 6 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum