Sciweavers

4850 search results - page 249 / 970
» Approximate Data Structures with Applications
Sort
View
INFOCOM
2000
IEEE
15 years 11 months ago
Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
Abstract—Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechan...
Zhiruo Cao, Zheng Wang, Ellen W. Zegura
DASFAA
2008
IEEE
188views Database» more  DASFAA 2008»
16 years 1 months ago
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
Lei Zou, Lei Chen 0002, Huaming Zhang, Yansheng Lu...
SSD
1995
Springer
97views Database» more  SSD 1995»
15 years 10 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet
ECLIPSE
2005
ACM
15 years 8 months ago
eAssignment: a case for EMF
Developing Eclipse plug-ins often involves the creation of data structures and corresponding data processing code. In developing eAssignment, an Eclipse-bases application to suppo...
Marcel Bruch, Christoph Bockisch, Thorsten Sch&aum...

Publication
116views
15 years 6 months ago
Poking Facebook: Characterization of OSN Applications
Facebook is one of the most popular Internet sites today. A key fea- ture that arguably contributed to Facebook's unprecedented success is its application platform, which enab...
Minas Gjoka, Michael Sirivianos, Athina Markopoulo...