Sciweavers

27692 search results - page 247 / 5539
» Where is ...
Sort
View
84
Voted
ECSCW
2003
15 years 2 months ago
Learning and Living in the 'New office'
‘Knowledge sharing’ and ‘learning’ are terms often connected with the ‘New office’, the “modern” open office space. Work in these settings becomes more and more dis...
Eva Bjerrum, Susanne Bødker
NETWORKING
2004
15 years 2 months ago
A Case for Mesh-Tree-Interaction in End System Multicasting
Abstract. End System Multicasting (ESM) is fast becoming a feasible alternative to IP multicasting. ESM approaches can be broadly classified into two main categories: (i) Tree firs...
Anirban Chakrabarti, Govindarasu Manimaran
101
Voted
NIPS
2004
15 years 2 months ago
Exponentiated Gradient Algorithms for Large-margin Structured Classification
We consider the problem of structured classification, where the task is to predict a label y from an input x, and y has meaningful internal structure. Our framework includes super...
Peter L. Bartlett, Michael Collins, Benjamin Taska...
SDL
2001
73views Hardware» more  SDL 2001»
15 years 2 months ago
HyperMSCs with Connectors for Advanced Visual System Modelling and Testing
Experiences with the use of the MSC language for complex system specifications have shown that certain extensions are necessary in order to arrive at sufficiently transparent and m...
Jens Grabowski, Peter Graubmann, Ekkart Rudolph
99
Voted
SODA
2004
ACM
152views Algorithms» more  SODA 2004»
15 years 2 months ago
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
Artur Czumaj, Michelangelo Grigni, Papa Sissokho, ...