Sciweavers

3220 search results - page 53 / 644
» Constrained Graph Processes
Sort
View
JCAM
2010
84views more  JCAM 2010»
13 years 4 months ago
An interior-point method for large constrained discrete ill-posed problems
Ill-posed problems are numerically underdetermined. It is therefore often beneficial to impose known properties of the desired solution, such as nonnegativity, during the solution...
Serena Morigi, Lothar Reichel, Fiorella Sgallari
MOBISYS
2004
ACM
14 years 9 months ago
Implementing Software on Resource-Constrained Mobile Sensors: Experiences with Impala and ZebraNet
ZebraNet is a mobile, wireless sensor network in which nodes move throughout an environment working to gather and process information about their surroundings [10]. As in many sen...
Ting Liu, Christopher M. Sadler, Pei Zhang, Margar...
MM
2005
ACM
140views Multimedia» more  MM 2005»
14 years 3 months ago
Web image clustering by consistent utilization of visual features and surrounding texts
Image clustering, an important technology for image processing, has been actively researched for a long period of time. Especially in recent years, with the explosive growth of th...
Bin Gao, Tie-Yan Liu, Tao Qin, Xin Zheng, QianShen...
CONCUR
2006
Springer
14 years 1 months ago
Some Remarks on Definability of Process Graphs
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
VLDB
1995
ACM
87views Database» more  VLDB 1995»
14 years 1 months ago
Redo Recovery after System Crashes
: This paper defines a framework for explaining redo recovery after a system crash. In this framework, an installation graph explains the order in which operations must be install...
David B. Lomet, Mark R. Tuttle