Sciweavers

1330 search results - page 245 / 266
» No Classic Boundary Conditions
Sort
View
75
Voted
SENSYS
2006
ACM
15 years 3 months ago
Capturing high-frequency phenomena using a bandwidth-limited sensor network
Small-form-factor, low-power wireless sensors—motes—are convenient to deploy, but lack the bandwidth to capture and transmit raw high-frequency data, such as human voices or n...
Ben Greenstein, Christopher Mar, Alex Pesterev, Sh...
CSB
2005
IEEE
146views Bioinformatics» more  CSB 2005»
15 years 3 months ago
Multi-Metric and Multi-Substructure Biclustering Analysis for Gene Expression Data
A good number of biclustering algorithms have been proposed for grouping gene expression data. Many of them have adopted matrix norms to define the similarity score of a bicluste...
Sun-Yuan Kung, Man-Wai Mak, Ilias Tagkopoulos
DIGRA
2005
Springer
15 years 3 months ago
Games, Montage and the First Person Point of View
Interactive montage combines the elements of play and visual representation. The analysis of four examples of interactive montage in reference to a first person point of view high...
Michael Nitsche
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 3 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
97
Voted
SPAA
2004
ACM
15 years 2 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter