Sciweavers

19866 search results - page 3869 / 3974
» Computing all factorizations in ***
Sort
View
89
Voted
ALENEX
2010
156views Algorithms» more  ALENEX 2010»
14 years 11 months ago
Tabulation Based 5-Universal Hashing and Linear Probing
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
Mikkel Thorup, Yin Zhang
DAGSTUHL
2007
14 years 11 months ago
Interdisciplinary Design Research for End-User Software Engineering
rocesses involve modeling – simplifying or abstracting some aspects of the problem domain in order to plan and evaluate design decisions. The use of representations to reason abo...
Alan F. Blackwell
DGO
2008
131views Education» more  DGO 2008»
14 years 11 months ago
A domain-specific language for urban simulation variables
UrbanSim is a modeling system for simulating the development of urban regions over periods of 20-30 years. Its purpose is to help evaluate alternative proposed policies and transp...
Alan Borning, Hana Sevcikova, Paul Waddell
LREC
2010
160views Education» more  LREC 2010»
14 years 11 months ago
FrAG, a Hybrid Constraint Grammar Parser for French
This paper describes a hybrid tagger/parser for French (FrAG), and presents results from ongoing development work, corpus annotation and evaluation. The core of the system is a se...
Eckhard Bick
NETWORKING
2010
14 years 11 months ago
Cost Bounds of Multicast Light-Trees in WDM Networks
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
Fen Zhou, Miklós Molnár, Bernard Cou...
« Prev « First page 3869 / 3974 Last » Next »