Sciweavers

410 search results - page 34 / 82
» Max and min limiters
Sort
View
STACS
2007
Springer
14 years 1 months ago
Hard Metrics from Cayley Graphs of Abelian Groups
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
Ilan Newman, Yuri Rabinovich
INFOCOM
2006
IEEE
14 years 1 months ago
An Integrated Framework for Managing Best Effort Traffic in MPLS Networks
— This paper presents a scalable and flexible system for explicit rate congestion control in Multi-Protocol Label Switched networks. Resource Reservation Protocol is used to sign...
Christopher Marty, Mohamed A. Ali
FCT
2005
Springer
14 years 1 months ago
A Simple and Fast Min-cut Algorithm
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
Michael Brinkmeier
VLDB
1995
ACM
155views Database» more  VLDB 1995»
13 years 11 months ago
Aggregate-Query Processing in Data Warehousing Environments
In this paper we introduce generalized projections (GPs), an extension of duplicateeliminating projections, that capture aggregations, groupbys, duplicate-eliminating projections ...
Ashish Gupta, Venky Harinarayan, Dallan Quass
CIKM
2008
Springer
13 years 9 months ago
Aggregate queries over ontologies
Answering queries over ontologies is an important issue for the Semantic Web. Aggregate queries were widely studied for relational databases but almost no results are known for ag...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Ca...