Sciweavers

493 search results - page 45 / 99
» Representing preferences using intervals
Sort
View
EMNLP
2008
13 years 9 months ago
Learning Graph Walk Based Similarity Measures for Parsed Text
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
Einat Minkov, William W. Cohen
ICCAD
2004
IEEE
147views Hardware» more  ICCAD 2004»
14 years 4 months ago
Interval-valued reduced order statistical interconnect modeling
9, IO]. However, unlike the case with static timing, it is not so easy We show how recent advances in the handling of correlated interval representations of range uncertainty can b...
James D. Ma, Rob A. Rutenbar
ICNP
1997
IEEE
13 years 11 months ago
On path selection for traffic with bandwidth guarantees
Transmission ofmultimedia streams imposesa minimum-bandwidth requirementon the path being usedto ensureend-to-endQuality-ofService (QoS) guarantees. While any shortest-path algori...
Qingming Ma, Peter Steenkiste
WWW
2008
ACM
14 years 8 months ago
Static query result caching revisited
Query result caching is an important mechanism for search engine efficiency. In this study, we first review several query features that are used to determine the contents of a sta...
Özgür Ulusoy, Ismail Sengör Alting&...
SIBGRAPI
2005
IEEE
14 years 1 months ago
TSD: A Shape Descriptor Based on a Distribution of Tensor Scale Local Orientation
We present tensor scale descriptor (TSD)— a shape descriptor for content-based image retrieval, registration, and analysis. TSD exploits the notion of local structure thickness,...
Paulo A. V. Miranda, Ricardo da Silva Torres, Alex...